Cover starters for covering arrays of strength two
نویسندگان
چکیده
منابع مشابه
Cover starters for covering arrays of strength two
A cover starter is a single vector that yields a covering array under the actions of groups on both the columns and the symbols of the starter. The existence of this compact representation of covering arrays facilitates effective exhaustive and heuristic search. When the group action on symbols fixes a small number f of symbols, such cover starters lead to covering arrays that embed covering ar...
متن کاملProfiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملprofiles of covering arrays of strength two
covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. while numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. random generation techniques c...
متن کاملProfiles of covering arrays of strength two
ARTICLE INFO Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation...
متن کاملCovering arrays of strength
A covering array of size N, degree k, order v and strength t is a k N array with entries from a set of v symbols such that in any t N subarray every t 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.10.026